TSTP Solution File: PUZ102^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : PUZ102^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 13:13:23 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ102^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 22:32:02 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TH0
% 0.20/0.53 %------------------------------------------------------------------------------
% 0.20/0.53 % File : PUZ102^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% 0.20/0.53 % Domain : Puzzles
% 0.20/0.53 % Problem : TPS problem from CHECKERBOARD-THMS
% 0.20/0.53 % Version : Especial.
% 0.20/0.53 % English :
% 0.20/0.53
% 0.20/0.53 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.53 % Source : [Bro09]
% 0.20/0.53 % Names : tps_0612 [Bro09]
% 0.20/0.53
% 0.20/0.53 % Status : Theorem
% 0.20/0.53 % Rating : 0.08 v8.1.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.2.0
% 0.20/0.53 % Syntax : Number of formulae : 4 ( 2 unt; 2 typ; 1 def)
% 0.20/0.53 % Number of atoms : 3 ( 1 equ; 0 cnn)
% 0.20/0.53 % Maximal formula atoms : 1 ( 1 avg)
% 0.20/0.53 % Number of connectives : 13 ( 0 ~; 0 |; 1 &; 10 @)
% 0.20/0.53 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.20/0.53 % Maximal formula depth : 5 ( 3 avg)
% 0.20/0.53 % Number of types : 2 ( 0 usr)
% 0.20/0.53 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.20/0.53 % Number of symbols : 3 ( 2 usr; 0 con; 1-2 aty)
% 0.20/0.53 % Number of variables : 5 ( 2 ^; 3 !; 0 ?; 5 :)
% 0.20/0.53 % SPC : TH0_THM_EQU_NAR
% 0.20/0.53
% 0.20/0.53 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.20/0.53 % project in the Department of Mathematical Sciences at Carnegie
% 0.20/0.53 % Mellon University. Distributed under the Creative Commons copyleft
% 0.20/0.53 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.20/0.53 % Bugfixes : v5.2.0 - Added missing type declarations.
% 0.20/0.53 %------------------------------------------------------------------------------
% 0.20/0.53 thf(s_type,type,
% 0.20/0.53 s: $i > $i ).
% 0.20/0.53
% 0.20/0.53 thf(cCKB_E2_type,type,
% 0.20/0.53 cCKB_E2: $i > $i > $o ).
% 0.20/0.53
% 0.20/0.53 thf(cCKB_E2_def,definition,
% 0.20/0.53 ( cCKB_E2
% 0.20/0.53 = ( ^ [Xx: $i,Xy: $i] :
% 0.20/0.53 ! [Xp: $i > $o] :
% 0.20/0.53 ( ( ( Xp @ Xx )
% 0.20/0.53 & ! [Xu: $i] :
% 0.20/0.53 ( ( Xp @ Xu )
% 0.20/0.53 => ( Xp @ ( s @ ( s @ Xu ) ) ) ) )
% 0.20/0.53 => ( Xp @ Xy ) ) ) ) ).
% 0.20/0.53
% 0.20/0.53 thf(cCKB_L33000,conjecture,
% 0.20/0.53 ! [Xx: $i] : ( cCKB_E2 @ Xx @ ( s @ ( s @ Xx ) ) ) ).
% 0.20/0.53
% 0.20/0.53 %------------------------------------------------------------------------------
% 0.20/0.53 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.5Cz9D8h5nG/cvc5---1.0.5_3360.p...
% 0.20/0.53 (declare-sort $$unsorted 0)
% 0.20/0.53 (declare-fun tptp.s ($$unsorted) $$unsorted)
% 0.20/0.53 (declare-fun tptp.cCKB_E2 ($$unsorted $$unsorted) Bool)
% 0.20/0.53 (assert (= tptp.cCKB_E2 (lambda ((Xx $$unsorted) (Xy $$unsorted)) (forall ((Xp (-> $$unsorted Bool))) (=> (and (@ Xp Xx) (forall ((Xu $$unsorted)) (=> (@ Xp Xu) (@ Xp (@ tptp.s (@ tptp.s Xu)))))) (@ Xp Xy))))))
% 0.20/0.53 (assert (not (forall ((Xx $$unsorted)) (@ (@ tptp.cCKB_E2 Xx) (@ tptp.s (@ tptp.s Xx))))))
% 0.20/0.53 (set-info :filename cvc5---1.0.5_3360)
% 0.20/0.53 (check-sat-assuming ( true ))
% 0.20/0.53 ------- get file name : TPTP file name is PUZ102^5
% 0.20/0.53 ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_3360.smt2...
% 0.20/0.53 --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.53 % SZS status Theorem for PUZ102^5
% 0.20/0.53 % SZS output start Proof for PUZ102^5
% 0.20/0.53 (
% 0.20/0.53 (let ((_let_1 (not (forall ((Xx $$unsorted)) (@ (@ tptp.cCKB_E2 Xx) (@ tptp.s (@ tptp.s Xx))))))) (let ((_let_2 (= tptp.cCKB_E2 (lambda ((Xx $$unsorted) (Xy $$unsorted)) (forall ((Xp (-> $$unsorted Bool))) (=> (and (@ Xp Xx) (forall ((Xu $$unsorted)) (=> (@ Xp Xu) (@ Xp (@ tptp.s (@ tptp.s Xu)))))) (@ Xp Xy))))))) (let ((_let_3 (forall ((Xu $$unsorted)) (or (not (ho_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 Xu)) (ho_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 (ho_3 k_2 (ho_3 k_2 Xu))))))) (let ((_let_4 (ho_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 (ho_3 k_2 (ho_3 k_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))))) (let ((_let_5 (ho_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_6 (not _let_5))) (let ((_let_7 (or _let_6 _let_4))) (let ((_let_8 (not _let_3))) (let ((_let_9 (or _let_6 _let_8 _let_4))) (let ((_let_10 (forall ((Xx $$unsorted) (BOUND_VARIABLE_649 |u_(-> $$unsorted Bool)|)) (or (not (ho_4 BOUND_VARIABLE_649 Xx)) (not (forall ((Xu $$unsorted)) (or (not (ho_4 BOUND_VARIABLE_649 Xu)) (ho_4 BOUND_VARIABLE_649 (ho_3 k_2 (ho_3 k_2 Xu)))))) (ho_4 BOUND_VARIABLE_649 (ho_3 k_2 (ho_3 k_2 Xx))))))) (let ((_let_11 (not _let_9))) (let ((_let_12 (not _let_10))) (let ((_let_13 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((Xx $$unsorted) (Xp (-> $$unsorted Bool))) (or (not (@ Xp Xx)) (not (forall ((Xu $$unsorted)) (or (not (@ Xp Xu)) (@ Xp (@ tptp.s (@ tptp.s Xu)))))) (@ Xp (@ tptp.s (@ tptp.s Xx)))))) _let_12))))))) (let ((_let_14 (or))) (let ((_let_15 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_13) :args (_let_12))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_10))) (REFL :args (_let_11)) :args _let_14)) _let_13 :args (_let_11 true _let_10)))) (let ((_let_16 (REFL :args (_let_9)))) (let ((_let_17 (not _let_7))) (let ((_let_18 (_let_3))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_18) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_18)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_7)) :args ((or _let_6 _let_4 _let_17))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_9 0)) (CONG _let_16 (MACRO_SR_PRED_INTRO :args ((= (not _let_6) _let_5))) :args _let_14)) :args ((or _let_5 _let_9))) _let_15 :args (_let_5 true _let_9)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_9 2)) _let_15 :args ((not _let_4) true _let_9)) :args (_let_17 false _let_5 true _let_4)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_9 1)) (CONG _let_16 (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_3))) :args _let_14)) :args ((or _let_3 _let_9))) _let_15 :args (_let_3 true _let_9)) :args (false true _let_7 false _let_3)) :args (_let_2 _let_1 true)))))))))))))))))))))
% 0.20/0.53 )
% 0.20/0.53 % SZS output end Proof for PUZ102^5
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------